Quantum Permutation Matrices
نویسندگان
چکیده
Abstract Quantum permutations arise in many aspects of modern “quantum mathematics”. However, the aim this article is to detach these objects from their context and give a friendly introduction purely within operator theory. We define quantum permutation matrices as whose entries are operators on Hilbert spaces; they obey certain assumptions generalizing classical matrices. number examples we list open problems. then put them back original an overview use several branches mathematics, such groups, information theory, graph theory free probability
منابع مشابه
Approximating Orthogonal Matrices by Permutation Matrices
Motivated in part by a problem of combinatorial optimization and in part by analogies with quantum computations, we consider approximations of orthogonal matrices U by “non-commutative convex combinations”A of permutation matrices of the type A = P Aσσ, where σ are permutation matrices and Aσ are positive semidefinite n × n matrices summing up to the identity matrix. We prove that for every n× ...
متن کاملSpectral statistics of permutation matrices.
We compute the mean two-point spectral form factor and the spectral number variance for permutation matrices of large order. The two-point correlation function is expressed in terms of generalized divisor functions, which are frequently discussed in number theory. Using classical results from number theory and casting them in a convenient form, we derive expressions which include the leading an...
متن کاملPartial Transpose of Permutation Matrices
The main purpose of this paper is to look at the notion of partial transpose from the combinatorial side. In this perspective, we solve some basic enumeration problems involving partial transpose of permutation matrices. Specifically, we count the number of permutations matrices which are invariant under partial transpose. We count the number of permutation matrices which are still permutation ...
متن کاملPartial Transposes of Permutation Matrices
The partial transpose of a block matrix M is the matrix obtained by transposing the blocks of M independently. We approach the notion of the partial transpose from a combinatorial point of view. In this perspective, we solve some basic enumeration problems concerning the partial transpose of permutation matrices. More specifically, we count the number of permutations matrices which are invarian...
متن کاملAlgebraic Quantum Permutation Groups
We discuss some algebraic aspects of quantum permutation groups, working over arbitrary fields. If K is any characteristic zero field, we show that there exists a universal cosemisimple Hopf algebra coacting on the diagonal algebra K: this is a refinement of Wang’s universality theorem for the (compact) quantum permutation group. We also prove a structural result for Hopf algebras having a non-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Complex Analysis and Operator Theory
سال: 2023
ISSN: ['1661-8254', '1661-8262']
DOI: https://doi.org/10.1007/s11785-023-01335-x